On the Optimality of the Counter Scheme for Dynamic Linear Lists

We consider policies that manage fixed-size dynamic linear lists, when the references follow the independent reference model. We define the counter scheme, a policy that keeps the records sorted by their access frequencies, and prove that among all deterministic policies it produces the least expected cost of access, at any time.